Effective version of the Shannon theorem: Polar codes
نویسنده
چکیده
A sequence of codes Cn = fn(Mn), n ≥ 1 is said to attain the transmission rate I(W ) on the channel W if for any ε > 0 there exists a sufficiently large n0 such that for all n ≥ n0 bothR > I(W )−ε and Pe(Cn) ≤ ε. Below we construct a sequence of linear binary codes Cn, n ≥ 1 of length N = 2 that attains the rate I(W ) of the channelW . For symmetric binary-input channels these codes are capacity-achieving.
منابع مشابه
An efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملNested Polar Codes Achieve the Shannon Rate-Distortion Function and the Shannon Capacity
It is shown that nested polar codes achieve the Shannon capacity of arbitrary discrete memoryless sources and the Shannon capacity of arbitrary discrete memory less channels.
متن کاملPolar Codes: Reliable Communication with Complexity Polynomial in the Gap to Shannon Capacity (Invited Talk)
Shannon’s monumental 1948 work laid the foundations for the rich fields of information and coding theory. The quest for efficient coding schemes to approach Shannon capacity has occupied researchers ever since, with spectacular progress enabling the widespread use of error-correcting codes in practice. Yet the theoretical problem of approaching capacity arbitrarily closely with polynomial compl...
متن کاملPolar codes in a QKD Environment
Polar coding is the most recent encoding scheme in the quest for error correction codes that approaches the Shannon limit, has a simple structure, and admits fast decoders. As such, it is an interesting candidate for the quantum key distribution (QKD) protocol that normally operates at high bit error rates and requires codes that operate near the Shannon limit. This paper describes approaches t...
متن کاملSchloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken/Wadern,
Shannon’s monumental 1948 work laid the foundations for the rich fields of information andcoding theory. The quest for efficient coding schemes to approach Shannon capacity has occupiedresearchers ever since, with spectacular progress enabling the widespread use of error-correctingcodes in practice. Yet the theoretical problem of approaching capacity arbitrarily closely withpoly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015